M a N a G E R Mastering the Middleware Muddle

نویسندگان

  • Alan W. Brown
  • Alan Cameron Wills
چکیده

build enterprise-scale distributed systems. Within this esoteric technology domain, it’s all too easy to hold up our hands and declare that the outlook is bleak for any kind of consensus on the direction distributed systems will take. Enterprise application integration issues, the nuances of competing middleware products from lots of vendors, and several overlapping standards activities all contribute to the confusion and uncertainty. To help us make sense of the middleware muddle, I’ll take this space to discuss the key concepts and issues involved. To better understand recent progress in this arena, let’s focus on current best practices for building enterprise-scale systems. That way, we can assess the current state of the technology and its impact on potential future strategies for distributed-systems developers. I’ll begin by generalizing that any successful solution in enterprise-scale software engineering has four key elements: processes, infrastructure, tools, and adoption services. Let’s briefly review current best practice in each of these four areas.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Amitraz Poisoning; A case study

A m i t r a z, a n i ns e c t i c i d e /a ca ri c i de of the f o r m a m i d i n e p e st i c i d e s group, is a ? 2 a d r e n e r g i c ag on i st a nd of t he a m i d i ne c h e m i ca l f a m il y generally us e d to c o n t r ol animal e c top a r a s i t e s. Poisoning due to am i t r a z i s r a r e and character...

متن کامل

On linear preservers of sgut-majorization on $textbf{M}_{n,m}$

Abstract. Let Mn;m be the set of n-by-m matrices with entries inthe field of real numbers. A matrix R in Mn = Mn;n is a generalizedrow substochastic matrix (g-row substochastic, for short) if Re e, where e = (1; 1; : : : ; 1)t. For X; Y 2 Mn;m, X is said to besgut-majorized by Y (denoted by X sgut Y ) if there exists ann-by-n upper triangular g-row substochastic matrix R such thatX = RY . This ...

متن کامل

Counting the number of spanning trees of graphs

A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.

متن کامل

SGLT-MAJORIZATION ON Mn,m AND ITS LINEAR PRESERVERS

A matrix R is said to be g-row substochastic if Re ≤ e. For X, Y ∈ Mn,m, it is said that X is sglt-majorized by Y , X ≺sglt Y , if there exists an n-by-n lower triangular g-row substochastic matrix R such that X = RY . This paper characterizes all (strong) linear preservers and strong linear preservers of ≺sglt on Rn and Mn,m, respectively.

متن کامل

Further results on odd mean labeling of some subdivision graphs

Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999